Skeletonization using an extended Euclidean distance transform

نویسندگان

  • Mark W. Wright
  • Roberto Cipolla
  • Peter J. Giblin
چکیده

A standard method to perform skeletonisation is to use a distance transform. Unfortunately such an approach has the drawback that only the Symmetric axis transform can be computed and not the more practical smoothed local symmetries or the more general symmetry set. Using singularity theory we introduce an extended distance transform which may be used to capture more of the symmetries of a shape. We describe the relationship of this extended distance transform to the skeletal shape descriptors themselves and other geometric phenomema related to the boundary of the curve. We then show how the extended distance transform can be used to derive skeletal descriptions of an object.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memory efficient skeletonization of utility maps

An algorithm is presented that allows to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided into overlapping tiles, which are skeletonized separately, using a Euclidean distance transform. The amount of overlap is controlled by the maximum expected width of any map component and the maximum size of what will be ...

متن کامل

Euclidean skeleton via centre-of-maximal-disc extraction

A skeletonization algorithm is presented, characterized by two main features: invariance under isometric transformations of the pattern, and recoverability. The algorithm is driven by the Euclidean distance map of the pattern. Invariance under isometric transformations is guaranteed due to the use of the Euclidean distance to compute the distance map; recoverability is guaranteed by the inclusi...

متن کامل

Euclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform

A general algorithm for computing Euclidean skeletons of 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. The algorithm is based upon the computation of 3D feature transforms, using a modification of an algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity w...

متن کامل

Skeleton Extraction Using SSM of the Distance Transform

This paper proposes a novel approach of skeletonization for both binary and gray-scale images based on the Skeleton Strength Map (SSM) calculated from Euclidean distance transform. The distance transform is firstly computed based on the boundary edges, and then its gradient vector field is calculated. After that, the isotropic diffusion is performed on the gradient vector field and the SSM is c...

متن کامل

A Pseudo-Distance Map for the Segmentation-Free Skeletonization of Gray-Scale Images

In this paper, we introduce a new tool, called a pseudodistance map (PDM), for extracting skeletons from grayscale images without region segmentation or edge detection. Given an edge-strength function (ESF) of a gray-scale image, the PDM is computed from the ESF using the partial differential equations we propose. The PDM can be thought of as a relaxed version of a Euclidean distance map. There...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Image Vision Comput.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1995